package com.cjm.algorithm.dp;

public class Ti674 {
    public static void main(String[] args) {

    }

    public int findLengthOfLCIS(int[] nums) {

        if (nums.length < 2) {
            return nums.length;
        }

        int res = 0;
        int max = 0;
        for (int i = 0; i < nums.length - 1; i++) {
            if (nums[i + 1] > nums[i]) {
                res++;
            } else {
                max = res > max ? res:max;
                res = 0;
            }
        }
        return max > res ? max:res;
    }
}
